Following a Maoist path

A path-following infeasible interior-point algorithm for semidefinite programming

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

Backward and forward path following control of a wheeled robot

A wheeled mobile robot is one of the most important types of mobile robots. A subcategory of these robots is wheeled robots towing trailer(s). Motion control problem, especially in backward motion is one of the challenging research topics in this field. In this article, a control algorithm for path-following problem of a tractor-trailer system is provided, which at the same time provides the ab...

charting a path to efficiencies following a

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

Path Following and Velocity Optimizing for an Omnidirectional Mobile Robot

In this paper, the path following controller of an omnidirectional mobile robot (OMR) has been extended in such a way that the forward velocity has been optimized and the actuator velocity constraints have been taken into account. Both have been attained through the proposed model predictive control (MPC) framework. The forward velocity has been included into the objective function, while the a...